| Name | Version | Summary | date |
| xs3d |
1.7.2 |
Compute cross sectional area of 3d shapes. |
2025-02-22 19:04:38 |
| microviewer |
1.11.0 |
Visualize 3D numpy arrays in the browser. |
2025-02-21 06:13:58 |
| crackle-codec |
0.30.0 |
Crackle 3D dense segmentation compression codec. |
2025-02-21 04:13:51 |
| fastmorph |
1.3.0 |
Morphological image processing for 3D multi-label images. |
2025-02-12 17:58:14 |
| tinybrain |
1.7.0 |
Image pyramid generation specialized for connectomics data types and procedures. |
2025-02-07 18:34:04 |
| mapbuffer |
1.0.1 |
Serializable map of integers to bytes with near zero parsing. |
2025-01-25 06:36:23 |
| cloud-files |
4.30.1 |
Fast access to cloud storage and local FS. |
2025-01-15 20:17:25 |
| compresso |
3.3.2 |
compresso algorithm variant based on work by Matejek et al. |
2025-01-08 16:10:59 |
| connected-components-3d |
3.22.0 |
Connected components on discrete and continuous multilabel 3D and 2D images. Handles 26, 18, and 6 connected variants; periodic boundaries (4, 8, & 6). |
2024-12-19 21:15:28 |
| rms-fpzip |
1.3.5 |
Numpy wrapper for fpzip algorithm (P. Lindstrom & M. Isenburg, 2006) RMS Fork |
2024-12-16 22:40:27 |
| dijkstra3d |
1.15.1 |
Implementation of Dijkstra's Shortest Path algorithm on 3D images. |
2024-07-06 18:10:38 |
| shard-computer |
1.2.1 |
A library for rapid computation of Neuroglancer Precomputed shard hashes. |
2024-06-24 15:29:01 |
| fpzip |
1.2.4 |
Numpy wrapper for fpzip algorithm (P. Lindstrom & M. Isenburg, 2006) |
2024-06-22 21:38:41 |
| fill-voids |
2.0.7 |
Fill voids in 3D binary images fast. |
2024-06-22 04:43:35 |
| edt |
2.4.1 |
Multi-Label Anisotropic Euclidean Distance Transform 3D |
2024-06-18 14:21:40 |
| fastremap |
1.14.2 |
Remap, mask, renumber, unique, and in-place transposition of 3D labeled images. Point cloud too. |
2024-06-18 00:43:38 |
| zfpc |
0.1.2 |
zfp container (zfpc) for optimal compression of 1D-4D arrays by representing correlated dimensions as separate zfp streams. |
2022-08-05 15:23:01 |
William Silversmith